Conditions on Periodicity for Sum-Free Sets
نویسندگان
چکیده
منابع مشابه
Notes on sum-free and related sets
Our main topic is the number of subsets of 1; n] which are maximal with respect to some condition such as being sum-free, having no number dividing another, etc. We also investigate some related questions. In our earlier paper 8], we considered conditions on sets of positive integers (sum-freeness, Sidon sequences, etc.), and attempted to estimate the number of subsets of 1; n] satisfying each ...
متن کاملNecessary and sufficient conditions for a sum-free set of positive integers to be ultimately periodic
Cameron has introduced a natural bijection between the set of one way infinite binary sequences and the set of sum-free sets (of positive integers), and observed that a sum-free set is ultimately periodic only if the corresponding binary sequence is ultimately periodic. He asked if the converse also holds. In this paper we present necessary and sufficient conditions for a sum-free set to be ult...
متن کاملOn the nature of solutions of the difference equation $mathbf{x_{n+1}=x_{n}x_{n-3}-1}$
We investigate the long-term behavior of solutions of the difference equation[ x_{n+1}=x_{n}x_{n-3}-1 ,, n=0 ,, 1 ,, ldots ,, ]noindent where the initial conditions $x_{-3} ,, x_{-2} ,, x_{-1} ,, x_{0}$ are real numbers. In particular, we look at the periodicity and asymptotic periodicity of solutions, as well as the existence of unbounded solutions.
متن کاملParallel Jobs Scheduling with a Specific Due Date: Asemi-definite Relaxation-based Algorithm
This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic scheduling assumptions. While the analytical conditions can be easily statedfor some simple models, a graph model approach is required when confli...
متن کاملAn Incremental DC Algorithm for the Minimum Sum-of-Squares Clustering
Here, an algorithm is presented for solving the minimum sum-of-squares clustering problems using their difference of convex representations. The proposed algorithm is based on an incremental approach and applies the well known DC algorithm at each iteration. The proposed algorithm is tested and compared with other clustering algorithms using large real world data sets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Experimental Mathematics
دوره 5 شماره
صفحات -
تاریخ انتشار 1996